"equisatisfiable" meaning in All languages combined

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "equi",
        "3": "satisfiable"
      },
      "expansion": "equi- + satisfiable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From equi- + satisfiable.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "equisatisfiable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        {
          "kind": "other",
          "name": "English entries with incorrect language header",
          "parents": [
            "Entries with incorrect language header",
            "Entry maintenance"
          ],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "English terms prefixed with equi-",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with 1 entry",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "other",
          "name": "Pages with entries",
          "parents": [],
          "source": "w"
        },
        {
          "kind": "topical",
          "langcode": "en",
          "name": "Logic",
          "orig": "en:Logic",
          "parents": [
            "Formal sciences",
            "Philosophy",
            "Sciences",
            "All topics",
            "Fundamental"
          ],
          "source": "w"
        }
      ],
      "examples": [
        {
          "ref": "2015, Xu Lu, Zhenhua Duan, Cong Tian, “Extending PPTL for Verifying Heap Evolution Properties”, in arXiv:",
          "text": "The \"isomorphic\" PPTL formulas can be obtained by first an equisatisfiable translation and then an isomorphic mapping.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Of a pair of formulas, where one formula is satisfiable whenever the other is satisfiable (either both formulas are satisfiable or both are not)."
      ],
      "id": "en-equisatisfiable-en-adj-Z7ASIiSc",
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "satisfiable",
          "satisfiable#English"
        ]
      ],
      "raw_glosses": [
        "(logic) Of a pair of formulas, where one formula is satisfiable whenever the other is satisfiable (either both formulas are satisfiable or both are not)."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "word": "equisatisfiable"
}

{
  "etymology_templates": [
    {
      "args": {
        "1": "en",
        "2": "equi",
        "3": "satisfiable"
      },
      "expansion": "equi- + satisfiable",
      "name": "prefix"
    }
  ],
  "etymology_text": "From equi- + satisfiable.",
  "head_templates": [
    {
      "args": {
        "1": "-"
      },
      "expansion": "equisatisfiable (not comparable)",
      "name": "en-adj"
    }
  ],
  "lang": "English",
  "lang_code": "en",
  "pos": "adj",
  "senses": [
    {
      "categories": [
        "English adjectives",
        "English entries with incorrect language header",
        "English lemmas",
        "English terms prefixed with equi-",
        "English terms with quotations",
        "English uncomparable adjectives",
        "Pages with 1 entry",
        "Pages with entries",
        "en:Logic"
      ],
      "examples": [
        {
          "ref": "2015, Xu Lu, Zhenhua Duan, Cong Tian, “Extending PPTL for Verifying Heap Evolution Properties”, in arXiv:",
          "text": "The \"isomorphic\" PPTL formulas can be obtained by first an equisatisfiable translation and then an isomorphic mapping.",
          "type": "quote"
        }
      ],
      "glosses": [
        "Of a pair of formulas, where one formula is satisfiable whenever the other is satisfiable (either both formulas are satisfiable or both are not)."
      ],
      "links": [
        [
          "logic",
          "logic"
        ],
        [
          "satisfiable",
          "satisfiable#English"
        ]
      ],
      "raw_glosses": [
        "(logic) Of a pair of formulas, where one formula is satisfiable whenever the other is satisfiable (either both formulas are satisfiable or both are not)."
      ],
      "tags": [
        "not-comparable"
      ],
      "topics": [
        "human-sciences",
        "logic",
        "mathematics",
        "philosophy",
        "sciences"
      ]
    }
  ],
  "word": "equisatisfiable"
}